package bishops;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;

/*
 * Problem 861 : Little Bishops.
 * Algorithm : Perform backtracking with pruning techniques.
 */
class Main 
{
	public static void main(String [] args)
	{
		//new LittleBishops().start();
		System.out.println(new String[3]);
	}
}

class LittleBishops
{
	public void start()
	{
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		
		try
		{
			String nbynChessBoard;
			String kBishops;
			
			while (!(nbynChessBoard = reader.readLine()).equals("0") && 
					!(kBishops = reader.readLine()).equals("0"))
			{
				int n = Integer.parseInt(nbynChessBoard);
				int k = Integer.parseInt(kBishops);
				
				
			}
			
		}
		catch (IOException ex)
		{
			ex.printStackTrace();
		}
	}
	
	public BigInteger evluateBishops(int nbynCB, int kBishops)
	{
		// Create an a matrix of n by n.
		String [][] chessBoard = createCB(nbynCB);
		
		return null;
	}
	
	public String  [][] createCB(int n)
	{
		String [][] chessBoard = new String[n+1][n+1];
		
		// Set a boundary on the chess board.
		createCheckBound(chessBoard);
		
		// Initialize chess board with default values.
		fillChessBoard(chessBoard);
		
		return chessBoard;
	}
	
	/*
	 * Create a boundary around the array with nulls.
	 * Easier for checking if we are still inside array or not.
	 */
	void createCheckBound(String [][] arrayGrid)
	{
		for (int row = 0; row < arrayGrid.length; row++)
		{
			for (int column = 0; column < arrayGrid[0].length; column++)
			{
				// Fill top.
				if (row == 0 || row == arrayGrid.length - 1)
				{
					arrayGrid[row][column] = "?";
				} 
				else if (column == 0 || column == arrayGrid[0].length - 1)
				{
					arrayGrid[row][column] = "?";
				} 
			}
		}
	}
	
	/*
	 * Initialize the chess board spaces with 't' value, representing
	 * the positions that the bishops can be placeed.
	 */
	public void fillChessBoard(String [][] chessBoard)
	{
		String placeValue = "t";
		
		for (int row = 1; row < chessBoard.length - 1; row++)
		{
			for (int column = 1; column < chessBoard[0].length - 1; column++)
			{
				chessBoard[row][column] = "t";
			}
		}
	}
}
